Exploiting the Structure of Two-Stage Robust Optimization Models with Integer Adversarial Variables
نویسندگان
چکیده
This paper addresses a class of two-stage robust optimization models with integer adversarial variables. We discuss the importance of this class of problems in modeling two-stage robust resource planning problems where some tasks have uncertain arrival times and duration periods. We apply Dantzig-Wolfe decomposition to exploit the structure of these models and show that the original problem reduces to a single-stage robust problem. We propose a Benders algorithm for the reformulated single-stage problem. Since the master problem and subproblem in the Benders algorithm are mixed integer programs, it is computationally demanding to solve them optimally at each iteration of the algorithm. Therefore, we develop novel stopping conditions for these mixed integer programs and provide the relevant convergence proofs. We also develop a heuristic algorithm called dual algorithm. In this heuristic, we dualize the linear programming relaxation of the adversarial problem in the reformulated problem and iteratively generate cuts to shape the convex hull of the uncertainty set. We combine this heuristic with the Benders algorithm to create a more effective algorithm called Benders-dual algorithm. Extensive computational experiments on a two-stage nurse planning problem are performed to compare these algorithms.
منابع مشابه
A robust multi-objective global supplier selection model under currency fluctuation and price discount
Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...
متن کاملExperiments in Robust Portfolio Optimization
This paper presents numerical experiments using cutting-plane algorithms to solve complex nonconvex robust optimization models arising in portfolio optimization. The models we study are motivated by realistic considerations, and are nominally NP-hard; however we show that using modern optimization methodology one can solve large, real-life models quite efficiently. Robust optimization is an app...
متن کاملA Robust Two-stage Data Envelopment Analysis Model for Measuring Efficiency: Considering Iranian Electricity Power Production and Distribution Processes
This paper presents a new robust two-stage Data Envelopment Analysis (DEA) for efficiency evaluation of the electricity power production and distribution companies. DEA has been widely used for benchmarking the electricity companies. Traditional studies in DEA consider systems as a whole when measuring the efficiency, ignoring the operation of individual processes within a system. To tackle thi...
متن کاملA two-stage GIS-based optimization model for the dry port location problem: A case study of Iran
This article aims to investigate the location of dry ports by providing a two-stage GIS-optimization model. At the first stage, the appropriate points for establishing dry ports were identified using GIS and hierarchical analysis process; then, the suitable points were introduced as the potential points to the second stage model. At the second stage, by providing a multi-objective integer model...
متن کاملDesign of An Integrated Robust Optimization Model for Closed-Loop Supply Chain and supplier and remanufacturing subcontractor selection
The development of optimization and mathematical models for closed loop supply chain (CLSC) design has attracted considerable interest over the past decades. However, the uncertainties that are inherent in the network design are challenging the capabilities of the developed tools. In CLSC Uncertainty in demand is major source of uncertainty. The aim of this paper, therefore, is to present a Rob...
متن کامل